Geometric optimization and the polynomial hierarchy
نویسندگان
چکیده
منابع مشابه
BPP and the Polynomial Hierarchy
We start with some definitions about probabilistic Turing machines (for a detailed exposition of this subject the reader is referred to [2]). Our basic model of computation is the Turing machine with input alphabet S z (0, l}. All machines are assumed to have two terminal states, namely q0 (reject) and 9, (accept). A probabilistic Turing machine (PTM) is syntactically the same as a nondetermini...
متن کاملThe Promise Polynomial Hierarchy
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise polynomial hierarchy is considerably simpler to work with, and many open questions about the polynomial hierarchy can be resolved in the promise polynomial hierarc...
متن کاملPolynomial-Length Planning Spans the Polynomial Hierarchy
This paper presents a family of results on the computational complexity of the decision problem associated with planning: Does a valid plan exist? We consider the effect on complexity of several assumptions typical of classical planning: complete knowledge of the initial state, determinism, polynomial-time determination of executability of actions in a state. We consider plans of two types: con...
متن کاملA bounded degree SOS hierarchy for polynomial optimization
We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P ) : f∗ = min{ f(x) : x ∈ K } on a compact basic semi-algebraic set K ⊂ Rn. This hierarchy combines some advantages of the standard LP-relaxations associated with Krivine’s positivity certificate and some advantages of the standard SOS-hierarchy. In particular it has the following attractiv...
متن کاملStrong duality in Lasserre's hierarchy for polynomial optimization
A polynomial optimization problem (POP) consists of minimizing a multivariate real polynomial on a semi-algebraic set K described by polynomial inequalities and equations. In its full generality it is a non-convex, multi-extremal, difficult global optimization problem. More than an decade ago, J. B. Lasserre proposed to solve POPs by a hierarchy of convex semidefinite programming (SDP) relaxati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90020-x